A note on S-packing colorings of lattices
نویسندگان
چکیده
Let a1, a2, . . . , ak be positive integers. An (a1, a2, . . . , ak)-packing coloring of a graph G is a mapping from V (G) to {1, 2, . . . , k} such that vertices with color i have pairwise distance greater than ai. In this paper, we study (a1, a2, . . . , ak)packing colorings of several lattices including the infinite square, triangular, and hexagonal lattices. For k small, we determine all ai such that these graphs have packing colorings. We also give some exact values and asymptotic bounds.
منابع مشابه
A SHORT NOTE ON ATOMS AND COATOMS IN SUBGROUP LATTICES OF GROUPS
In this paper we give an elementary argument about the atoms and coatoms of the latticeof all subgroups of a group. It is proved that an abelian group of finite exponent is strongly coatomic.
متن کاملRevisiting the Hexagonal Lattice: on Optimal Lattice Circle Packing
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highest density circle packing among all lattices in R2. With the benefit of hindsight, we show that the problem can be restricted to the important class of well-rounded lattices, on which the density function takes a particularly simple form. Our proof emphasizes the role of well-rounded lattices for...
متن کاملA NOTE ON STRATIFIED LM-FILTERS
We develop a theory of stratified $LM$-filters which generalizes the theory of stratified $L$-filters. Our stratification condition explicitly depends on a suitable mapping between the lattices $L$ and $M$. If $L$ and $M$ are identical and the mapping is the identity mapping, then we obtain the theory of stratified $L$-filters. Based on the stratified $LM$-filters, a general theory of lattice-v...
متن کاملWiener Way to Dimensionality
This note introduces a new general conjecture correlating the dimensionality dT of an infinite lattice with N nodes to the asymptotic value of its Wiener Index W(N). In the limit of large N the general asymptotic behavior W(N)≈Ns is proposed, where the exponent s and dT are related by the conjectured formula s=2+1/dT allowing a new definition of dimensionality dW=(s-2)-1. Being related to the t...
متن کاملOn Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 166 شماره
صفحات -
تاریخ انتشار 2014